ALGORITHM:

Enqueue
1.	Start
2.	If the stack is empty,then read the data
3.	Increment the rear and store the data in the rear index of q
4.	Stop

Dequeue  
1.	Start
2.	Set the element to be deleted as q[front]
3.	Increment front
4.	Stop
Is empty
1.	Start
2.	If rear is less than front then return 1
3.	Otherwise return 0
4.	Stop
Is full
1.	If rear is equal to one less than the size then return 1
2.	Otherwise return 0
3.	Stop
Display
1.	Start
2.	From front as the first index and rear as the last index print all the elements
3.	Stop 
